A Nonmonotone Filter Method for Minimax Problems
نویسندگان
چکیده
In this paper, we propose a modified trust-region filter method algorithm for Minimax problems, which based on the framework of SQP-filter method and associated with the technique of nonmonotone method. We use the SQP subproblem to acquire an attempt step, and use the filter to weigh the effect of the attempt step so as to avoid using penalty function. The algorithm uses the Lagrange function as a merit function and the nonmonotone filter to improve the effect of the algorithm. Under some mild conditions, we prove the global convergence.
منابع مشابه
Solving the Unconstrained Optimization Problems Using the Combination of Nonmonotone Trust Region Algorithm and Filter Technique
In this paper, we propose a new nonmonotone adaptive trust region method for solving unconstrained optimization problems that is equipped with the filter technique. In the proposed method, the various nonmonotone technique is used. Using this technique, the algorithm can advantage from nonmonotone properties and it can increase the rate of solving the problems. Also, the filter that is used in...
متن کاملA Trust-region Method using Extended Nonmonotone Technique for Unconstrained Optimization
In this paper, we present a nonmonotone trust-region algorithm for unconstrained optimization. We first introduce a variant of the nonmonotone strategy proposed by Ahookhosh and Amini cite{AhA 01} and incorporate it into the trust-region framework to construct a more efficient approach. Our new nonmonotone strategy combines the current function value with the maximum function values in some pri...
متن کاملNonmonotone Line Search for Minimax Problems
It was recently shown that, in the solution of smooth constrained optimization problems by sequential quadratic programming (SQP), the Maratos eeect can be prevented by means of a certain nonmonotone (more precisely, three-step or four-step monotone) line search. Using a well known transformation, this scheme can be readily extended to the case of minimax problems. It turns out however that, du...
متن کاملMinimax Rules Under Zero-One Loss for a Restricted Location
Minimax Rules Under Zero-One Loss In this paper, we obtain minimax and near-minimax nonrandomized decision rules under zeroone loss for a restricted location parameter of an absolutely continuous distribution. Two types of rules are addressed: monotone and nonmonotone. A complete-class theorem is proved for the monotone case. This theorem extends the previous work of Zeytinoglu and Mintz (1984)...
متن کاملAlmost Equalizer, Bayes and Minimax Decision Rules
In this report minimax and near-minimax nonrandomized decision rules under zero-one loss for a restricted location parameter of an absolutely continuous distribution are obtained. Two types of rules are addressed: monotone and non-monotone. A complete-class theorem is obtained in the monotone case, where the results are an extension of a previous work of Zeytinoglu and Mintz (1984) from the cas...
متن کامل